Online-Efficient Interval Test via Secure Empty-Set Check

Efficient Interval Check in the Presence of Malicious Adversaries

We consider the following problem: Assuming that Alice and Bob have an integer interval [a, e] and an integer b respectively, for a commitment c to b, Alice and Bob jointly check whether b is within [a, e] without revealing their inputs, where either party may behave maliciously. A special case of the problem is the secure integer comparison in the malicious model. This problem mainly arises fr...

Design and Test of Energy-Efficient, High-Performance, and Secure Computing Technologies via Accelerators

Models solvable through the empty-interval method

The most general one dimensional reaction-diffusion model with nearestneighbor interactions solvable through the empty interval method, and without any restriction on the particle-generation from two adjacent empty sites is studied. It is shown that turning on the reactions which generate particles from two adjacent empty sites, results in a gap in the spectrum of the evolution operator (or equ...

Efficient Classification via Multiresolution Training Set Approximation

We consider the classification problem as a problem of approximating a given training set. This approximation is constructed as a multi-resolution sparse grid, and organized in a tree-structure. It allows efficient training and query, both in constant time per training point, for low-dimensional classification problems (D . 10) with large data sets. The memory required for such problems is usua...

An Efficient and Secure Protocol for Privacy Preserving Set Intersection

When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we address the Privacy Preserving Set Intersection (PPSI) problem, in which each party learns no elements other than the intersection of the N private datasets. We propose an efficient protocol based on a threshold cryptosystem...